Slender graphs
نویسندگان
چکیده
منابع مشابه
Full Friendly Index Sets of Slender and Flat Cylinder Graphs
Let G = (V, E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f∗ : E → Z2 defined by f∗(xy) = f(x) + f(y) for each xy ∈ E. For i ∈ Z2, let vf (i) = |f−1(i)| and ef (i) = |f∗−1(i)|. A labeling f is called friendly if |vf (1)− vf (0)| ≤ 1. The full friendly index set of G consists all possible differences between the number of edges labeled by 1 and the number of edge...
متن کاملProperties of Slender Rings
Slender rings and their products are characterized in terms of algebraic and topological properties. Possible limitations on uncountable products of such rings are discussed. Ring, module, and topological terminology and notation are standard. R denotes a unital ring with identity 1, and R ω denotes its countable product, that is, the set of all sequences of elements of R. Of course ω {0, 1,. ....
متن کاملImproved Slender-Set Linear Cryptanalysis
In 2013, Borghoff et al. introduced a slender-set linear cryptanalysis on PRESENT-like ciphers with key-dependent secret S-boxes. In this paper, we propose an improved slender-set linear attack to PRESENTlike ciphers with secret S-boxes. We investigate three new cryptanalytic techniques, and use them to recover the secret S-boxes efficiently. Our first new idea is that we propose a new techniqu...
متن کاملSlender Classes . Rod Downey And
A Π1 class P is called thin if, given a subclass P ′ of P there is a clopen C with P ′ = P ∩C. Cholak, Coles, Downey and Herrmann [7] proved that a Π1 class P is thin if and only if its lattice of subclasses forms a Boolean algebra. Those authors also proved that if this boolean algebra is the free Boolean algebra, then all such think classes are automorphic in the lattice of Π1 classes under i...
متن کاملSlender-Body Methods for Predicting Ship Squat
A review is made of linear slender-body methods for predicting the squat of a ship in shallow open water, dredged channels or canals. The results are summarized into a general formula based on Fourier transforms, and the method is extended to cater to stepped canals. An approximate solution for canals of arbitrary cross-section is proposed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1989
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90022-1